When learning to classify by relations is easier than by features
نویسندگان
چکیده
Relational reasoning is often considered more resource intensive than featurebased reasoning. This view implies that learning categories defined by relational regularities should be more difficult than learning categories defined by featural regularities. Unfortunately previous studies do not ground featural and relational information in a common perceptual substrate. After addressing this concern, a series of experiments compare learning performance for relationand feature-based categories. Under certain circumstances we find faster learning for relation-based categories. The results suggest that mechanisms rooted in relational processes (e.g., relative stimulus judgement, analogical comparison) facilitate or hinder learning depending on whether the relational processes highlight or obscure the underlying category structure. Conversely, category learning affects relational processes by promoting relational comparisons that increase the coherence of acquired categories. In contrast to the largely independent research efforts in category learning and analogy research, our findings suggest that learning and comparison processes are deeply intertwined.
منابع مشابه
Classification of Brain Tumor by Combination of Pre-Trained VGG16 CNN
In recent years, brain tumors become the leading cause of death in the world. Detection and rapid classification of this tumor are very important and may indicate the likely diagnosis and treatment strategy. In this paper, we propose deep learning techniques based on the combinations of pre-trained VGG-16 CNNs to classify three types of brain tumors (i.e., meningioma, glioma, and pituitary tumo...
متن کاملRapid Learning with Stochastic Focus of Attention
We present a method to stop the evaluation of a decision making process when the result of the full evaluation is obvious. This trait is highly desirable for online marginbased machine learning algorithms where a classifier traditionally evaluates all the features for every example. We observe that some examples are easier to classify than others, a phenomenon which is characterized by the even...
متن کاملA Novel Architecture for Detecting Phishing Webpages using Cost-based Feature Selection
Phishing is one of the luring techniques used to exploit personal information. A phishing webpage detection system (PWDS) extracts features to determine whether it is a phishing webpage or not. Selecting appropriate features improves the performance of PWDS. Performance criteria are detection accuracy and system response time. The major time consumed by PWDS arises from feature extraction that ...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملDiagnosis of OCD Patients Using Drawing Features of Bender Gestalt Shapes
Background: Since psychological tests such as questionnaire or drawing tests are almost qualitative, their results carry a degree of uncertainty and sometimes subjectivity. The deficiency of all drawing tests is that the assessment is carried out after drawing the objects and lots of information such as pen angle, speed, curvature and pressure are missed through the test. In other words, the ps...
متن کامل